A Comparison of Two Torus-Based K-Coteries
نویسندگان
چکیده
We extend a torus-based coterie structure for distributed mutual exclusion to allow k multiple entries in a critical section. In the original coterie, the system nodes are logically arranged in a rectangle, called a torus, in which the last row (column) is followed by the first row (column) using end wraparound. A torus quorum consists of a head and a tail, where the head contains one entire row and the tail contains one node from each of the s succeeding rows, s≥ 1 is a system parameter. It has been shown that by setting s= h / 2 ,
منابع مشابه
Nondominated k-Coteries for Multiple Mutual Exclusion
Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. In order to enter its critical section, a node must obtain permission from a quorum of nodes. A collection of quorums is called a coterie. The most resilient coteries are called nondominated coteries. Recently, k-coteries were proposed to be used in mutual exclusion algorithms that allow up to k entr...
متن کاملThe Availability of Complemental k-Coteries
k-Coterie is a graceful concept to solve the distributed k-mutual exclusion problem. The k-mutual exclusion algorithm adopting k-coteries could provide the fault-tolerant capability. The complementalness and the availability are two important metrics to measure the fault-tolerant capability of a k-coterie. Since those two metrics are defined under two different failure assumptions, for a given ...
متن کاملA Statistical Study of two Diffusion Processes on Torus and Their Applications
Diffusion Processes such as Brownian motions and Ornstein-Uhlenbeck processes are the classes of stochastic processes that have been investigated by researchers in various disciplines including biological sciences. It is usually assumed that the outcomes of these processes are laid on the Euclidean spaces. However, some data in physical, chemical and biological phenomena indicate that they cann...
متن کاملA Coterie Join Operation and Tree Structured k-Coteries
ÐThe coterie join operation proposed by Neilsen and Mizuno produces, from a k-coterie and a coterie, a new k-coterie. For the coterie join operation, this paper first shows 1) a necessary and sufficient condition to produce a nondominated k-coterie (more accurately, a nondominated k-semicoterie satisfying Nonintersection Property) and 2) a sufficient condition to produce a k-coterie with higher...
متن کاملLocal Coteries and a Distributed Resource Allocation Algorithm
In this paper, we discuss a resource allocation problem in distributed systems. Consider a distributed system consisting of a set of processes and a set of resources of identical type. Each process has access to a (sub)set of the resources. Different processes may have access to different sets of the resources. Each resource must be accessed in a mutually exclusive manner, and processes are all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998